Scheduling Executors with Time-varying Resource Demands on Data-Parallel Computation Frameworks
نویسندگان
چکیده
منابع مشابه
Dynamic Remapping of Parallel Computations with Varying Resource Demands
A large class of computational problems are characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem must be solved on a message passing multiprocessor machine, the combination of these characteristics lead to system performance which decreases in time. Performance can be improved with periodic redistribution of computatio...
متن کاملResource Allocation for Covering Time Varying Demands
We consider the problem of allocating resources to satisfy demand requirements varying over time. The input specifies a demand for each timeslot. Each resource is specified by a start-time, end-time, an associated cost and a capacity. A feasible solution is a multiset of resources such that at any point of time, the sum of the capacities offered by the resources is at least the demand requireme...
متن کاملA Multi-objective optimization model for project scheduling with time-varying resource requirements and capacities
Proper and realistic scheduling is an important factor of success for every project. In reality, project scheduling often involves several objectives that must be realized simultaneously, and faces numerous uncertainties that may undermine the integrity of the devised schedule. Thus, the manner of dealing with such uncertainties is of particular importance for effective planning. A realistic sc...
متن کاملAdapting to Varying Demands in Resource Constrained Real-Time Devices
In-home entertainment systems are becoming popular because they allow a variety of consumer electronic (CE) devices to be connected, using a wireless network, to form a system capable of handling multimedia content. Using such a system provide the end-users the possibility of transparently streaming multimedia content between devices of varying capabilities. This is possible because the system ...
متن کاملScheduling Parallel Jobs with Time-Resource Tradeoff via Nonlinear Programming
We consider a scheduling problem where the processing time of any job is dependent on the usage of a discrete renewable resource, e.g. personnel. An amount of k units of that resource can be allocated to the jobs at any time, and the more of that resource is allocated to a job, the smaller its processing time. The objective is to find a resource allocation and a schedule that minimizes the make...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Social Science, Education and Human Science
سال: 2017
ISSN: 2475-0042
DOI: 10.12783/dtssehs/asshm2016/8355